Avoiding slack variables in the solving of linear diophantine equations and inequations
نویسندگان
چکیده
منابع مشابه
Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables
Debugging Constraint Programs p. 204 An Optimizing Compiler for CLP(R) p. 222 Local and Global Relational Consistency p. 240 Dynamic Variable Ordering in CSPs p. 258 A Unifying Framework for Tractable Constraints p. 276 On the Forward Checking Algorithm p. 292 A Confluent Calculus for Concurrent Constraint Programming with Guarded Choice p. 310 Situated Simplification p. 328 Guarded Constructiv...
متن کاملAvoiding Slack Variables in the Solving
In this paper, we present an algorithm for solving directly linear Dio-phantine systems of both equations and inequations. Here directly means without adding slack variables for encoding inequalities as equalities. This algorithm is an extension of the algorithm due to Contejean and Devie 10] for solving linear Diophantine systems of equations, which is itself a generalization of the algorithm ...
متن کاملSolving Linear Diophantine Equations
An overview of a family of methods for nding the minimal solutions to a single linear Diophantine equation over the natural numbers is given. Most of the formal details were dropped, some illustrations that might give some intuition on the methods being presented instead.
متن کاملSolving Elliptic Diophantine Equations Avoiding Thue Equations and Elliptic Logarithms
This research was supported by the Netherlands Mathematical Research Foundation SWON with nancial aid from the Netherlands Organization for Scienti c Research NWO. We determine the solutions in integers of the equation y = (x + p)(x + p) for p = 167, 223, 337, 1201. The method used was suggested to us by Yu. Bilu, and is shown to be in some cases more efficient than other general purpose method...
متن کاملFast Methods for Solving Linear Diophantine Equations
We present some recent results from our research on methods for finding the minimal solutions to linear Diophantine equations over the naturals. We give an overview of a family of methods we developed and describe two of them, called Slopes algorithm and Rectangles algorithm. From empirical evidence obtained by directly comparing our methods with others, and which is partly presented here, we a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00195-8